Higher-level constructs for families and multisets
نویسندگان
چکیده
منابع مشابه
Higher-Level Constructs in the READY Event Notification System
There is growing interest in the use of general-purpose event notification services as “middleware” for gluing together independently-developed distributed applications. This approach was first discussed by Oki et.al.in 1993 [10], where an early version of the (now) TIBCO Information Bus [13] was described. Since then, many other commercial products have been developed that accept events from e...
متن کاملHigher-Order Families
A redex family is a set of redexes which arècreated in the same way'. Families specify which redexes should be shared in any so-called optimal implementation of a rewriting system. We formalise the notion of family for orthogonal higher-order term rewriting systems (OHRSs). In order to comfort our formalisation of the intuitive concept of family, we actually provide three conceptually diierent ...
متن کاملMetrics for Mining Multisets
A multiset (also referred to as a bag) is a set (collection of elements where the order is of no importance), where the elements do not need to be unique. A vase with n blue and m red marbles is a multiset for example. We propose a new class of distance measures (metrics) designed for multisets, both of which are a recurrent theme in many data mining [2] applications. One particular instance of...
متن کاملThresholds for families of multisets, with an application to graph pebbling
In this paper we prove two multiset analogs of classical results. We prove a multiset analog of Lovász’s version of the Kruskal-Katona Theorem and an analog of the Bollobás-Thomason threshold result. As a corollary we obtain the existence of pebbling thresholds for arbitrary graph sequences. In addition, we improve both the lower and upper bounds for the ‘random pebbling’ threshold of the seque...
متن کاملPriority Queues and Multisets
A priority queue, a container data structure equipped with the operations insert and delete-minimum, can re-order its input in various ways, depending both on the input and on the sequence of operations used. If a given input σ can produce a particular output τ then (σ, τ) is said to be an allowable pair. It is shown that allowable pairs on a fixed multiset are in one-to-one correspondence with...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2017
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2017.01.034